Section: New Results

Data Structures and Robust Geometric Computation

Explicit array-based compact data structures for triangulations

Participant : Olivier Devillers.

In collaboration with Luca Castelli Aleardi (LIX, Palaiseau).

We consider the problem of designing space efficient solutions for representing triangle meshes. Our main result is a new explicit data structure for compactly representing planar triangulations: if one is allowed to permute input vertices, then a triangulation with $n$ vertices requires at most $4n$ references ($5n$ references if vertex permutations are not allowed). Our solution combines existing techniques from mesh encoding with a novel use of minimal Schnyder woods. Our approach extends to higher genus triangulations and could be applied to other families of meshes (such as quadrangular or polygonal meshes). As far as we know, our solution provides the most parsimonious data structures for triangulations, allowing constant time navigation in the worst case. Our data structures require linear construction time, and all space bounds hold in the worst case. We have implemented and tested our results, and experiments confirm the practical interest of compact data structures[47] , [35]

Hyperbolic Delaunay triangulations and Voronoi diagrams made practical

Participants : Mikhail Bogdanov, Olivier Devillers, Monique Teillaud.

Figure 6. Hyperbolic Delaunay triangulation and Voronoi diagram in the Poicaré plane.

We show how to compute Delaunay triangulations and Voronoi diagrams of a set of points in hyperbolic space in a very simple way. The algorithm is implemented in an exact and efficient way[34] (see Figure 6 ).